Location:
Search - n factorial
Search list
Description: 应用c++开发的n的阶乘的程序-application development n factorial procedure
Platform: |
Size: 1897 |
Author: 林进 |
Hits:
Description: 用链表实现的大数阶乘，可以计算n万的阶乘，不过3万以上，时间就很长了。
Platform: |
Size: 1142201 |
Author: 裴国东 |
Hits:
Description: 一般来说，任何大于0的正整数n的阶乘等于n与（n-1）的阶乘的积，即n!=n（n-1）!。用（n-1）!的值来表示n!的值其表达式就是一种递归调用，因为一个阶乘的值是以另一个阶乘的值为基础的。
此程序是采用递归调用求正数n的阶乘的程序
Platform: |
Size: 11611 |
Author: 王伟 |
Hits:
Description: 用来计算N！最后一位非0数字，有一定的数论原理包含其中
Platform: |
Size: 98050 |
Author: 白伟 |
Hits:
Description: n的阶乘.rar 可以求数的阶乘 是以递归算法为基础的 对学习算法设计与-n factorial. Rar can help factorial number of recursive algorithm is based on the learning algorithm design and
Platform: |
Size: 5115 |
Author: 张微 |
Hits:
Description: 实现组合C(M,N)运算,程序结构简单鲜明,运用递归算法,取代流行的数组方式储存,实现组合运算-achieve portfolio C (M, N) Operational procedures simple structure distinctive, using recursive algorithm to replace the popular approach to storage arrays to achieve portfolio Operational .......................
Platform: |
Size: 235248 |
Author: 莫斯韦 |
Hits:
Description: 应用c++开发的n的阶乘的程序-application development n factorial procedure
Platform: |
Size: 2048 |
Author: 林进 |
Hits:
Description: 实现组合C(M,N)运算,程序结构简单鲜明,运用递归算法,取代流行的数组方式储存,实现组合运算-achieve portfolio C (M, N) Operational procedures simple structure distinctive, using recursive algorithm to replace the popular approach to storage arrays to achieve portfolio Operational .......................
Platform: |
Size: 234496 |
Author: 莫斯韦 |
Hits:
Description: 一般来说，任何大于0的正整数n的阶乘等于n与（n-1）的阶乘的积，即n!=n（n-1）!。用（n-1）!的值来表示n!的值其表达式就是一种递归调用，因为一个阶乘的值是以另一个阶乘的值为基础的。
此程序是采用递归调用求正数n的阶乘的程序
-In general, any positive integer greater than 0, the factorial n equal to n and (n-1) of the factorial of the plot, that is, n! = N (n-1)!. With (n-1)! Express the value of n! The value of its expression is a recursive call, because the value of a factorial is a factorial of the value-based. This procedure is used for recursive calls the factorial n is the number of procedures
Platform: |
Size: 11264 |
Author: 王伟 |
Hits:
Description: 用VC6.0编译出的求阶乘算法（0---10000）标准C 语言控制台应用程序 -Using VC6.0 compiler seek out factorial algorithm (0-10000) standard C language console application
Platform: |
Size: 1024 |
Author: 郭俊 |
Hits:
Description: 计算N！：
编写计算N阶乘的程序，数值N由键盘输入，N的值要在0到65536之间（用一个16位的字表示），结果在显示器上显示。
-Calculation of N! : Preparation of N factorial process calculation, numerical N from keyboard input, N the value of 0-65536 in between (with a 16-bit word that), the results shown in the display.
Platform: |
Size: 4096 |
Author: 李丽 |
Hits:
Description: 任意一个字符串(字母和数字），在其中插一、题目：阶乘
源程序名 fact.??? (pas,c,cpp)
可执行文件名 fact.exe
输入文件名 fact.in
输出文件名 fact.out
阶乘的定义如下： N! = 1 * 2 * 3 * ... * N-1 * N
例如， 12! = 1*2*3*4*5*6*7*8*9*10*11*12 = 479001600
最右的非0位是6，后面有2个0。
写一个程序计算N!最右非0位和末尾的0的个数。
输入
一个整数N, 1 <= N <= 1,000,000
输出
一行输出2个整数：最右非0位，末尾0的个数。
样例
fact.in
12
fact.out
6 2
-An arbitrary string (letters and numbers), in which the interpolation I, entitled: factorial source of fact.??? (Pas, c, cpp) file name of the executable file name fact.exe input file name fact.in output fact . out of the definition of factorial as follows: N! = 1* 2* 3* ...* N-1* N For example, 12! = 1* 2* 3* 4* 5* 6* 7* 8* 9* 10* 11* 12 = 479001600 the right of non-0 is 6, followed by 2 0. Write a program computing N! The most right at the end of non-0 and the number of 0. Input an integer N, 1 < = N < = 1,000,000 Output Output his two integers: the right of non-0, at the end of the number 0. Sample fact.in 12 fact.out 6 2
Platform: |
Size: 9216 |
Author: 哈密瓜 |
Hits:
Description: The factorial of a nonnegative integer n is written n! (pronounced “n factorial”) and is defined
as follows:
n! = n • (n - 1) • (n - 2) • ... • 1 (for values of n greater than or equal to 1)
and
n! = 1 (for n = 0).
For example, 5! = 5 • 4 • 3 • 2 • 1, which is 120.
a) Write an application that reads a nonnegative integer from an input dialog and computes
and prints its factorial.
-The factorial of a nonnegative integer n is written n! (pronounced “n factorial”) and is defined
as follows:
n! = n • (n - 1) • (n - 2) • ... • 1 (for values of n greater than or equal to 1)
and
n! = 1 (for n = 0).
For example, 5! = 5 • 4 • 3 • 2 • 1, which is 120.
a) Write an application that reads a nonnegative integer from an input dialog and computes
and prints its factorial.
Platform: |
Size: 1024 |
Author: sillyp |
Hits:
Description: 求任意一个自然数N的阶乘，返回值的大小，同时若有调用错误返回提示信息-Find any natural number N factorial, the size of the return value, while if an error return message calls
Platform: |
Size: 1024 |
Author: deng |
Hits:
Description: 一个对求n的阶乘的高精度算法，看了后会让你大开眼界-One pair of high-precision requirements of n factorial algorithm, you will after reading an eye-opener ~ ~
Platform: |
Size: 43008 |
Author: 叶梓 |
Hits:
Description: 利用VC++計算N階乘
簡單又實用的範例-Examples of the use of VC++ calculate N factorial simple and practical
Platform: |
Size: 171008 |
Author: Eden |
Hits:
Description: labview 实现n的阶乘 思路清晰 适合初学者参考-labview clear ideas of n factorial reference for beginners
Platform: |
Size: 5120 |
Author: 铁皮青蛙 |
Hits:
Description: n：n 的阶乘
返回值：阶乘结果的位数
注意：
本程序直接输出n!的结果，需要返回结果请保留long a[]
需要math.h
-n: n factorial
Return value: the median factorial results
Note:
The results of this program directly output n!, You need to return the results, please retain long a []
Need math.h
Platform: |
Size: 47104 |
Author: 袁丽丽 |
Hits:
Description: This is a program that count factorial of big data.
Platform: |
Size: 3072 |
Author: hagh
|
Hits:
Description: 使用c++实现的n阶乘求和的功能，在windows环境下运行。(The function of n factorial summation implemented by c++ is run in Windows environment.)
Platform: |
Size: 14336 |
Author: yangwenhan |
Hits: